Automated Theorem Proving in Temporal Logic:T-Resolution

This paper presentes a novel resolution method,T-resolution,based on the first order temporal logic.The primary claim of this method is its soundness and completeness.For this purpose,we construct the corresponding semantic trees and extend Herbrand‘s Theorem.     

Genetic algorithms for optimal logical database design

The focus of this paper is database design using automated database design tools or more general CASE tools. We present a genetic algorithm for the optimization of (internal) database structures, using a multi-criterion objective function. This function expresses conflicting objectives, reflecting the well-known time/space trade-off. This paper shows how the solution space of the algorithm can be set up in the form of tree structures (forests), and how these are encoded by a simple integer assignation. Genetic operators (database transformations) defined in terms of this encoding behave as if they manipulate tree structures. Some basic experimental results produced by a research prototype are presented.     

Integration of knowledge-based systems with data processing

Transaction Oriented Prolog-Online Environment is a multi-user, mainframe implementation of the logic programming language Prolog, specially designed and developed for the data processing environment. This article describes the background, functionality, implementation and use of TOP-ONE, stressing that applications of knowledge-based systems technology to data processing environments will achieve full success only when existing systems and existing conventional data are incorporated within the applications.     

海上石油平台陆地建造过程安全管理数据库系统开发

针对海上石油平台陆地建造过程的复杂性,开发了规范、完善的安全管理数据库系统。该系统为建造企业提供了新的管理手段和理念,极大的提高了劳动效率,有利于减少事故的发生。     

岩心扫描成像技术及其网络数据库管理系统

伴随着信息技术的发展,传统的岩心管理方法已不适应现代信息共享的需求。为了有效地发挥岩心这一珍贵地质资料在生产、科研和管理中的作用,通过对岩心扫描成像技术的介绍,系统地描述了岩心扫描仪的特点、数据库的建立、岩心资料的永久性保存和管理以及网络化管理。认为随着计算机技术的不断发展与进步,信息技术在提升石油勘探开发水平方面将会起到重要作用,改进传统的岩心图文资料管理方法,推行计算机管理是现代信息管理的必然要求。     

主存技术与时态数据库

多年来，时态数据库的研究与实现受到内存资源的制约。硬件技术的进步为数据库管理系统提供了海量内存。本文提出把时态数据库的全部或大部分数据置于主存中，并能在不读写磁盘的情况下连续作多个事务，称之为时态主存数据库（ＴｅｍｐｏｒａｌＭａｉｎＭｅｍｏｒｙＤＢ，以下简称ＴＭＭＤＢ）。该文讨论了ＴＭＭＤＢ的功能、标准、内存布局、与大缓存ＤＢＭＳ的本质差异，以及由“时态”和“主存”技术结合而引起的一系列特殊问题。     

第三方物流企业信息化问题研究

探讨了物流信息化的基本概念及其主要内容，并就其对第三方物流企业的作用进行了阐述。最后以安泰物流信息化建设为案例讲述了具体的第三方物流企业信息化建设。     

灵活运用数据库设计理论

简介了关系模型、键、完整性规则、E-R模型、函数依赖、模式分解和关系模式的范式等数据库技术基础和规范化设计理论，从键和完整性规则的实现、数据冗余的特殊情况和字典设计等方面论述了在实际设计工作中如何灵活运用关系数据库设计理论。     

Development of materials database system for cae system of heat treatment based on data mining technology

Computer simulation for materials processing needs of materials. In order to employ the accumulated large data on a huge database containing a great deal of various physical properties materials heat treatment in the past years, it is significant to develop an intelligent database system. Based on the data mining technology for data analysis, an intelligent database web tool system of computer simulation for heat treatment process named as IndBASEweb-HT was built up. The architecture and the arithmetic of this system as well as its application were introduced.     

Branching and pruning: An optimal temporal POCL planner based on constraint programming

A key feature of modern optimal planners such as graphplan and blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planners provide an alternative branching scheme but lacking comparable pruning mechanisms do not perform as well. In this paper, a domain-independent formulation of temporal planning based on Constraint Programming is introduced that successfully combines a POCL branching scheme with powerful and sound pruning rules. The key novelty in the formulation is the ability to reason about supports, precedences, and causal links involving actions that are not in the plan. Experiments over a wide range of benchmarks show that the resulting optimal temporal planner is much faster than current ones and is competitive with the best parallel planners in the special case in which actions have all the same duration.¹